Graphs, Games, and Pragmaticism’s Proof
نویسندگان
چکیده
Peirce believed that his pragmaticism can be conclusively proven. Beginning in 1903, he drafted several attempts, ending by 1908 with a semeiotic proof. Around 1905, he exposes the proof using the theory of Existential Graphs (EGs). This paper modernises the semantics Peirce proposed for EGs in terms of game-theoretic semantics (GTS). Peirce’s 1905 proof is then reconstructed in three parts, by (i) relating pragmaticism to the GTS conception of meaning, (ii) showing that Peirce’s proof is an argument for a relational structure of the meaning of intellectual signs that our interpretative and strategic practices give rise to, and (iii) bringing out the key links between EGs and pragmaticism.
منابع مشابه
Proof of Space from Stacked Bipartite Graphs
This report presents a proof of space protocol based on pebble games on stacked bipartite graphs.
متن کاملParity games, separations, and the modal μ-calculus
The topics of this thesis are the modal μ-calculus and parity games. The modal μ-calculus is a common logic for model-checking in computer science. The modelchecking problem of the modal μ-calculus is polynomial time equivalent to solving parity games, a 2-player game on labeled directed graphs. We present the first FPT algorithms (fixed-parameter tractable) for the model-checking problem of th...
متن کاملCubic symmetric graphs of orders $36p$ and $36p^{2}$
A graph is textit{symmetric}, if its automorphism group is transitive on the set of its arcs. In this paper, we classifyall the connected cubic symmetric graphs of order $36p$ and $36p^{2}$, for each prime $p$, of which the proof depends on the classification of finite simple groups.
متن کاملOn the bandwidth of Mobius graphs
Bandwidth labelling is a well known research area in graph theory. We provide a new proof that the bandwidth of Mobius ladder is 4, if it is not a $K_{4}$, and investigate the bandwidth of a wider class of Mobius graphs of even strips.
متن کاملA chip-firing variation and a new proof of Cayley's Formula
We introduce a variation of chip-firing games on connected graphs. These ‘burn-off’ games incorporate the loss of energy that may occur in the physical processes that classical chipfiring games have been used to model. For a graph G = (V,E), a configuration of ‘chips’ on its nodes is a mapping C : V → N. We study the configurations that can arise in the course of iterating a burn-off game. Afte...
متن کامل